On Some Issues in the Foundation of Rough Sets: the Problem of Definition

نویسنده

  • Mihir K. Chakraborty
چکیده

In this presentation we shall raise the following issues connected with the discourse of rough set theory: 1. indistinguishability 2. definition of a rough set 3. language dependency, the problem of referent 4. vagueness 5. abstraction 6. application-friendliness We shall argue that existing practices prevailing in rough set research fall short in addressing most of the issues. After almost fifty years of rough-set studies it may be interesting, if not a necessity, to look into some basic aspects of its foundation. Indistinguishability At the base level of all kinds of rough sets lies an indiscernibility relation (ind) which is at least reflexive and symmetric. This relation gives rise to the granulation G of the universe. That is, clustering of the objects: G a , the granule corresponding to the object a is G a = {x : a ind x}. This is true also for covering-based rough sets since from a covering C at first the granules viz. One can consider elements belonging to the same granule as mutually indiscernible. While defining lower and upper approximations the granules are used differently. In fact any covering is itself a granulation. With the help of this, working granules N(a), N a , P a etc. are formed. This indiscernibility is at the philosophical root of rough set theory. We talk about one individual but think about every one in the granule which it belongs to. This duality prevails althrough. Some objects are indistinguishable though not identical-like quantam objects (Logical and Philosophical Remarks on Quasi-Set Theory, Da Costa, Krause). Also this indistinguishability lies at the root of the Sorites type characteristic feature of vagueness, about which we shall discuss also. With the help of the basic granules, approximations of a concept or set, a second-order entity is envisaged, and this is the main entry point to the application (or use) of granulation. A set 'A' is approximated by a pair G(A) and G(A) where usually G(A) ⊆ A ⊆ G(A), but not always. Then a second layer of indiscernibility arises, that of the concepts. Two concepts A and B are indistinguishable if and only if they admit the same approximations with respect to a given granulation. At this level also a dichotomy prevails; concepts A and B are not the same, yet there is no means to distinguish them. Again, a name has different referents. In the conceptual framework of rough set theory …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making

In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...

متن کامل

A New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)

Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...

متن کامل

On $L$-double fuzzy rough sets

ur aim of this  paper  is  to introduce the concept of $L$-double fuzzy rough sets in whichboth constructive and axiomatic approaches are used. In constructive approach, a pairof $L$-double fuzzy lower (resp. upper) approximation operators is defined  and the basic properties of them  are studied.From the viewpoint of the axiomatic approach, a set of axioms is constructed to characterize the $L...

متن کامل

Fuzzy-rough Information Gain Ratio Approach to Filter-wrapper Feature Selection

Feature selection for various applications has been carried out for many years in many different research areas. However, there is a trade-off between finding feature subsets with minimum length and increasing the classification accuracy. In this paper, a filter-wrapper feature selection approach based on fuzzy-rough gain ratio is proposed to tackle this problem. As a search strategy, a modifie...

متن کامل

T-Rough Sets Based on the Lattices

The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...

متن کامل

Topological structure on generalized approximation space related to n-arry relation

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 148  شماره 

صفحات  -

تاریخ انتشار 2016